Solving nonlinear inverse problems by evolution equations based on Gauss–Newton methods
نویسنده
چکیده
منابع مشابه
Newton-type regularization methods for nonlinear inverse problems
Inverse problems arise whenever one searches for unknown causes based on observation of their effects. Such problems are usually ill-posed in the sense that their solutions do not depend continuously on the data. In practical applications, one never has the exact data; instead only noisy data are available due to errors in the measurements. Thus, the development of stable methods for solving in...
متن کاملOn a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
In this paper we consider a class of regularized Gauss-Newton methods for solving nonlinear inverse problems for which an a posteriori stopping rule is proposed to terminate the iteration. Such methods have the frozen feature that they require only the computation of the Fréchet derivative at the initial approximation. Thus the computational work is considerably reduced. Under certain mild cond...
متن کاملA Projected Hessian Gauss-newton Algorithm for Solving Systems of Nonlinear Equations and Inequalities
Solving systems of nonlinear equations and inequalities is of critical importance in many engineering problems. In general, the existence of inequalities in the problem adds to its difficulty. We propose a new projected Hessian Gauss-Newton algorithm for solving general nonlinear systems of equalities and inequalities. The algorithm uses the projected Gauss-Newton Hessian in conjunction with an...
متن کاملContinuous regularized Gauss-Newton-type algorithm for nonlinear ill-posed equations with simultaneous updates of inverse derivative
A new continuous regularized Gauss-Newton-type method with simultaneous updates of the operator (F (x(t))F (x(t)) + ε(t)I) for solving nonlinear ill-posed equations in a Hilbert space is proposed. A convergence theorem is proved. An attractive and novel feature of the proposed method is the absence of the assumptions about the location of the spectrum of the operator F (x). The absence of such ...
متن کاملA Gauss - Newton method for convex composite optimization 1
An extension of the Gauss-Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization of h o F under two conditions, namely h has a set of weak sharp minima, C, and there is a regular point of the inclusion F(x) E C. This result extends a similar convergence result due to Womersley (this journa...
متن کامل